In a scale of 2L identifier space, coordinates in each dimension are divided with Binary Search. The nodes which correspond with the divided coordinates compose the next hoop set as a pointer table which cuts down the search scope from whole CAN to a local CAN area. 在规模为2L的标识符空间上采取折半查找的方法对各维坐标进行划分,并建立相应的下一跳节点集合&指针表,使搜索空间由全网缩减到一个相对较小的指定局部区域。